Non-extendible finite polycycles
نویسندگان
چکیده
We give a fairly simple proof of a result announced in [2] that there are only seven non-extendible finite (r, q)-polycycles: the tetrahedron without a face, the cube without a face, the octahedron without a face, the dodecahedron without a face, the icosahedron without a face, the split-vertex octahedron and the split-vertex icosahedron.
منابع مشابه
Types and boundary uniqueness of polypentagons
A connected plane graph taken with its interior faces forms an (r, q)-polycycle if the interior faces are all r-gons (where r = const > 3), while all interior vertices are of the maximal possible degree, denoted by q (where q = const > 3); see [1]. Any finite (r, q)-polycycle is homeomorphic to a disc and its boundary is homeomorphic to a circle. The cyclic sequence q1q2 . . . qm formed by the ...
متن کاملNon-accumulation of Critical Points of the Poincaré Time on Hyperbolic Polycycles
We call Poincaré time the time associated to the Poincaré (or first return) map of a vector field. In this paper we prove the non-accumulation of isolated critical points of the Poincaré time T on hyperbolic polycycles of polynomial vector fields. The result is obtained by proving that the Poincaré time of a hyperbolic polycycle either has an unbounded principal part or is an almost regular fun...
متن کاملExtremal And
|We continue the analysis of (r; q)-polycycles, i.e., planar graphs G that admit a realization on the plane such that all internal vertices have degree q, all boundary vertices have degree at most q, and all internal faces are combinatorial r-triangles; moreover, the vertices, edges, and internal faces form a cell complex. Two extremal problems related to chemistry are solved: the description o...
متن کاملAn Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing
Finite-state techniques are widely used in various areas of Natural Language Processing (NLP). As Kaplan and Kay (1994) have argued, regular expressions are the appropriate level of abstraction for thinking about finite-state languages and finite-state relations. More complex finite-state operations (such as contexted replacement) are defined on the basis of more basic operations (such as Kleen...
متن کاملFree-Extendible Prefix-Free Sets and an Extension of the Kraft-Chaitin Theorem
First, the dual set of a finite prefix–free set is defined. Using this notion we describe equivalent conditions for a finite prefix–free set to be indefinitely extendible. This lead to a simple proof for the Kraft– Chaitin Theorem. Finally, we discuss the influence of the alphabet size on the indefinite extensibility property.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006